منابع مشابه
K.Khadiev WIDTH HIERARCHY FOR K-OBDD OF SMALL WIDTH
In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...
متن کاملWidth Hierarchy for k-OBDD of Small Width
In this paper was explored well known model k-OBDD. There are proven width based hierarchy of classes of boolean functions which computed by k-OBDD. The proof of hierarchy is based on sufficient condition of Boolean function’s non representation as k-OBDD and complexity properties of Boolean function SAF. This function is modification of known Pointer Jumping (PJ) and Indirect Storage Access (I...
متن کاملThe collapse of the bounded width hierarchy
We show that every constraint satisfaction problem over a fixed constraint language that has bounded relational width has also relational width (2, 3). Together with known results this gives a trichotomy for width: a constraint satisfaction problem has either relational width 1, or relational width (2, 3) (and no smaller width), or does not have bounded relational width.
متن کاملSearching Constant Width Mazes Captures theAC Hierarchy
We show that searching a width k maze is complete for Πk, i.e., for the k’th level of the AC0 hierarchy. Equivalently, st-connectivity for width k grid graphs is complete for Πk. As an application, we show that there is a data structure solving dynamic st-connectivity for constant width grid graphs with time boundO(log log n) per operation on a random access machine. The dynamic algorithm is de...
متن کاملTree-width and the monadic quantifier hierarchy
It is well known that on classes of graphs of bounded tree-width, every monadic second-order property is decidable in polynomial time. The converse is not true without further assumptions. It follows from the work of Robertson and Seymour, that if a class of graphs K has unbounded tree-width and is closed under minors, then K contains all planar graphs. But on planar graphs, three-colorability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lobachevskii Journal of Mathematics
سال: 2015
ISSN: 1995-0802,1818-9962
DOI: 10.1134/s1995080215020092